An optimal minimum spanning tree algorithm
نویسندگان
چکیده
منابع مشابه
An optimal minimum spanning tree algorithm
This thesis describes the optimal minimum spanning tree algorithm given by Pettie and Ramachandran (in Journal of the ACM, 2002). The algorithm presented finds a minimum spanning tree of a graph with n vertices and m edges deterministically in time O (T ∗ (m,n)), where T ∗ is the minimum number of edge-weight comparisons needed to determine the solution of the problem. The function T ∗ is the d...
متن کاملAn Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification
We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(log n) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the problem.
متن کاملParallel Minimum Spanning Tree Algorithm
The Minimal Spanning Tree (MST) problem is a classical graph problem which has many applications in various areas. In this paper we discuss a concurrent MST algorithm derived from Prim’s algorithm presented by Setia et al. in 2009, targeting symmetric multiprocessing (SMP) with a shared address space. The pseudocode of the algorithm is presented, combined with three interesting heuristics in or...
متن کاملOptimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm
In a network of asynchronous processors, the cost to send a message can diier signiicantly from one communication link to another. Assume that associated with each link is a positive weight representing the cost of sending one message along the link and the cost of an algorithm executed on a weighted network is the sum of the costs of all messages sent during its execution. We present a distrib...
متن کاملAn Optimal Minimum Spanning
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Speciically, we present a deterministic algorithm to nd a minimum spanning forest of a graph with n vertices and m edges that runs in time O(T (m; n)) where T is the minimum number of edge-weight comparisons needed to determine the solution. The algorithm is quite simple a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2002
ISSN: 0004-5411,1557-735X
DOI: 10.1145/505241.505243